2-1 addition and related arithmetic operations with threshold logic
نویسندگان
چکیده
منابع مشابه
2-1 Additions and Related Arithmetic Operations with Threshold Logic
In this paper we investigate the reduction of the size for small depth feed-forward linear threshold networks performing binary addition, comparison, and related functions. For n bit operands we propose a depth-3 O(n 2 log n) asymptotic size network for the binary addition with polynomially bounded weights. We propose also a depth-3 addition of optimal O(n) asymptotic size network and a depth-2...
متن کاملSigned Digit Addition and Related Operations with Threshold Logic
ÐAssuming signed digit number representations, we investigate the implementation of some addition related operations assuming linear threshold networks. We measure the depth and size of the networks in terms of linear threshold gates. We show first that a depth-2 network with O n size, weight, and fan-in complexities can perform signed digit symmetric functions. Consequently, assuming radix-2 ...
متن کاملSigned Digit Addition and Related Operations with Threshold Logic Sorin Cot Ofann a and Stamatis Vassiliadis
Assuming signed digit number representations we investigate the implementation of some addition related operations assuming linear threshold networks. We measure the depth and size of the networks in terms of linear threshold gates. We show rst that a depth-2 network with O(n) size, weight and fan-in complexities can perform signed digit symmetric functions. Consequently, assuming radix-2 signe...
متن کامل1 Redundant Addition with Threshold Logic
In this paper we investigate threshold based networks performing 2 1 addition using redundant binary operand representations. In particular we concern with establishing the networks with the smallest network depth assuming small weight and fan-in values. First we propose a depth-4 implementation and we show that the 2 1 addition can be computed by a threshold network with the size in the order ...
متن کاملArithmetic and logic operations with DNA
The use of DNA molecules to solve hard computational problems has been demonstrated in recent studies. However, the question of suitability of DNA for solving simple computer operations, such as boolean or arithmetic operations, has largely been unaddressed. Incorporation of these operations in DNA computing is essential for solving a wide range of applications. We present a xed bit encoding sc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 1996
ISSN: 0018-9340,1557-9956,2326-3814
DOI: 10.1109/12.537130